minimum maximal matching造句

例句与造句

1. Therefore a minimum maximal matching has the same size as a minimum edge dominating set.
2. Furthermore, the size of a minimum edge dominating set equals the size of a minimum maximal matching.
3. A minimum maximal matching is a minimum edge dominating set; Figure ( b ) is an example of a minimum maximal matching.
4. A minimum maximal matching is a minimum edge dominating set; Figure ( b ) is an example of a minimum maximal matching.
5. In particular, this shows that any maximal matching is a 2-approximation of a maximum matching and also a 2-approximation of a minimum maximal matching.
6. It's difficult to find minimum maximal matching in a sentence. 用minimum maximal matching造句挺难的
7. Determining the achromatic number is NP-hard; determining if it is greater than a given number is NP-complete, as shown by Yannakakis and Gavril in 1978 by transformation from the minimum maximal matching problem.
8. However, no polynomial-time algorithm is known for finding a "'minimum maximal matching "', that is, a maximal matching that contains the " smallest " possible number of edges.
9. This inequality is tight : for example, if " G " is a path with 3 edges and 4 vertices, the size of a minimum maximal matching is 1 and the size of a maximum matching is 2.
10. A minimum edge dominating set is not necessarily a minimum maximal matching, as illustrated in Figure ( a ); however, given a minimum edge dominating set " D ", it is easy to find a minimum maximal matching with | " D " | edges ( see, e . g ., ).
11. A minimum edge dominating set is not necessarily a minimum maximal matching, as illustrated in Figure ( a ); however, given a minimum edge dominating set " D ", it is easy to find a minimum maximal matching with | " D " | edges ( see, e . g ., ).
12. Edge dominating set, dominating set, r-dominating set, connected dominating set, r-scattered set, minimum maximal matching, independent set, maximum full-degree spanning tree, maximum induced at most d-degree subgraph, maximum internal spanning tree, induced matching, triangle packing, partial r-dominating set and partial vertex cover admit an EPTAS on apex-minor-free graphs.